We study the capacity region $C_L$ of an arbitrarily varying multiple-accesschannel (AVMAC) for deterministic codes with decoding into a list of a fixedsize $L$ and for the average error probability criterion. Motivated by knownresults in the study of fixed size list decoding for a point-to-pointarbitrarily varying channel, we define for every AVMAC whose capacity regionfor random codes has a nonempty interior, a nonnegative integer $\Omega$ calledits symmetrizability. It is shown that for every $L \leq \Omega$, $C_L$ has anempty interior, and for every $L \geq (\Omega+1)^2$, $C_L$ equals thenondegenerate capacity region of the AVMAC for random codes with a knownsingle-letter characterization. For a binary AVMAC with a nondegenerate randomcode capacity region, it is shown that the symmetrizability is always finite.
展开▼
机译：我们研究了任意变化的多址信道（AVMAC）的容量区域$ C_L $，用于确定性代码（解码为固定大小的$ L $列表）和平均错误概率准则。出于对点到点任意变化的信道进行固定大小列表解码研究的已知结果的启发，我们为每个随机码的容量区域具有非空内部的AVMAC定义了一个非负整数$ \ Omega $，称为对称性。结果表明，对于每个$ L \ leq \ Omega $，$ C_L $内部都是空的，对于每个$ L \ geq（\ Omega + 1）^ 2 $，$ C_L $等于AVMAC的非退化容量区域。具有已知单字母特征的代码。对于具有非简并随机码容量区域的二进制AVMAC，表明对称性始终是有限的。
展开▼
